Bounds on the Rate of Codes Which Forbid Specified Difference Sequences
نویسندگان
چکیده
Certain magnetic recording applications call for a large number of sequences whose differences do not include certain disallowed patterns. We show that the number of such sequences increases exponentially with their length and that the exponent, or capacity, is the logarithm of the joint spectral radius of an appropriately defined set of matrices. We derive new algorithms for determining the joint spectral radius of sets of nonnegative matrices and combine them with existing algorithms to determine the capacity of several sets of disallowed differences that arise in practice.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملNew bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملOn the Parity-Check Density and Achievable Rates of LDPC Codes
The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds on the parity-check density are expressed in terms of the gap between the channel capacity and the rate of the codes for which reliable communication is achi...
متن کاملOn Some Properties of the Shrinking Generator
We obtain several results about the output rate and distribution of zeros and ones of the shrinking generator associated with two linear recurring sequences. These results are based on various bounds on the number of zeros of linear recurring sequences. Non-linear recurring sequences are considered as well.
متن کاملDiscrepancy, separation and Riesz energy of point sets on the unit sphere
When does a sequence of spherical codes with “good” spherical cap discrepancy, and “good” separation also have “good” Riesz s-energy? For d > 2 and the Riesz s-energy for 0 < s < d, we consider asymptotically equidistributed sequences of S codes with an upper bound δ on discrepancy and a lower bound ∆ on separation. For such sequences, the difference between the normalized Riesz s-energy and th...
متن کامل